An Efficient Multiple Cell Upsets Tolerant Content-Addressable Memory
نویسندگان
چکیده
منابع مشابه
A Multiple-Valued Ferroelectric Content-Addressable Memory
A novel architecture f o r a Multiple-Valued Ferroelectric Content-Addressable Memory (FCAM) is proposed. An FCAM employs ferroelectric capacitors as storage elements to provide a nonvolatile content-addressable memory. A 2-bit search operation is performed by a simultaneous access to a 4-level polarization, hence reducing the total number of search operations to h a y Four FCAM structures are ...
متن کاملContent Addressable Memory Using XNOR CAM Cell
One of the special types of Computer Memory is said to be as Content Addressable Memory. It is also called as associative array or associative storage, associative memory which can be frequently used in very high speed searching applications such as databases, associative computing, lookup tables and networking. CAM is one type of functional memory which contains huge amount of stored data wher...
متن کامل“ Memristor & Content Addressable Memory ”
-Memristor is the fourth fundamental passive element after resistor, inductor and capacitor. Memristor is memory resistor which is two terminal device. This semiconductor device is statistically proved by a student in china Leon Chua in 1971. And discovered by scientist. R.Stanley Williams and its team in April 30,2008 in lab of HP. It consist a semiconductor of titanium dioxide in which one ha...
متن کاملUltra-Efficient Content Addressable Memory for Tunable GPU Approximation
In this paper, we describe a resistive configurable associative memory (ReCAM) that enables selective approximation and asymmetric voltage overscaling to manage delivered efficiency. The ReCAM structure matches an input pattern with pre-stored ones by applying an approximate search on selected bit indices (bitline-configurable). To further reduce energy, we explore proper ReCAM sizing, various ...
متن کاملDynamically Fault-Tolerant Content Addressable Networks
We describe a content addressable network which is robust in the face of massive adversarial attacks and in a highly dynamic environment. Our network is robust in the sense that at any time, an arbitrarily large fraction of the peers can reach an arbitrarily large fraction of the data items. The network can be created and maintained in a completely distributed fashion.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2014
ISSN: 0018-9340
DOI: 10.1109/tc.2013.90